The optimal LLL algorithm is still polynomial in fixed dimension
نویسندگان
چکیده
منابع مشابه
A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed
We prove that for any dimension d there exists a polynomial time algorithm for counting integral points in polyhedra in the d-dimensional Euclidean space. Previously such algorithms were known for dimensions d =1,2,3, and 4 only.
متن کاملInteger Polynomial Optimization in Fixed Dimension
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an integer polynomial over the lattice points of a convex polytope, we show an algorithm to compute lower and upper bounds for the optimal value. For polynomials t...
متن کاملWorst-Case Complexity of the Optimal LLL Algorithm
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter t of the algorithm has its extreme value 1. This case is of interest because the output is then the strongest Lovász–reduced basis. Experiments reported by Lagarias and Odlyzko [LO83] seem to show that the algorithm remain polynomial in average. However no bound better...
متن کاملExponent of Periodicity of Word Equations in Fixed Dimension is Polynomial
The exponent of periodicity is a key parameter used in all currently known algorithms for solving word equations. A lower bound for it is 2c|E|, where |E| is the length of the equation E. We prove that in fixed dimension, i.e., when the variables belong to a fixed set V , the exponent of periodicity can be bound by a polynomial p(|E|) of degree no more than thrice the size of the set V .
متن کاملComputing the independence polynomial in Shearer's region for the LLL
The independence polynomial has been widely studied in algebraic graph theory, in statistical physics, and in algorithms for counting and sampling problems. Seminal results of Weitz (2006) and Sly (2010) have shown that in bounded-degree graphs the independence polynomial can be efficiently approximated if the argument is positive and below a certain threshold, whereas above that threshold the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00616-3